Herbrand Constraint Solving in HAL
نویسندگان
چکیده
منابع مشابه
Trailing Analysis for HAL
The HAL language includes a Herbrand constraint solver which uses Taylor’s PARMA scheme rather than the standard WAM representation. This allows HAL to generate more efficient Mercury code. Unfortunately, PARMA’s variable representation requires value trailing with a trail stack consumption about twice as large as for the WAM. We present a trailing analysis aimed at determining which Herbrand v...
متن کاملType inference for GADTs via Herbrand constraint abduction
Type inference for Hindley/Milner and variants is well understood as a constraint solving problem. Recent extensions to Hindley/Milner such as generalized algebraic data types (GADTs) force us to go beyond this approach to inference. In this paper we show how to perform type inference for GADTs using Herbrand constraint abduction, a solving method to infer missing facts in terms of Herbrand con...
متن کاملImproving PARMA trailing
Taylor introduced a variable binding scheme for logic variables in his PARMA system, that uses cycles of bindings rather than the linear chains of bindings used in the standard WAM representation. Both the HAL and dProlog languages make use of the PARMA representation in their Herbrand constraint solvers. Unfortunately, PARMA’s trailing scheme is considerably more expensive in both time and spa...
متن کاملTrue Equality Constraints over an Open Universe of Terms 1
For a rst-order language L, the Herbrand universe consists of ground terms of L. We deened 15, 16, 17] an !-Herbrand universe for L by introducing the following modiication: rst add to L countably many new individual constants, and then form the set of all ground terms of the resulting language. Newly added constants make this universe \open" and suitable for modeling those situations in databa...
متن کاملSolving Mixed Quantified Constraints over a Domain Based on Real Numbers and Herbrand Terms
Combining the logic of hereditary Harrop formulas HH with a constraint system, a logic programming language is obtained that extends Horn clauses in two different directions, thus enhancing substantially the expressivity of Prolog. The implementation of this new language requires the ability to test the satisfiability of constraints built up by means of terms and predicates belonging to the dom...
متن کامل